#include<stdio.h>

void int_cmp(const void* p1, const void* p2)
{
	return( *(int*)p1) - (*(int*)p2);
}
int main()
{
	int arr[] = { 2,6,3,5,1,4,8,9,7,0 };
	int i = 0;
	qsort(arr, sizeof(arr) / sizeof(arr[0]), sizeof(int), int_cmp);
	for (i=0 ; i < sizeof(arr) / sizeof(arr[0]); i++)
	{
		printf("%d", arr[i]);
	}
	printf("\n");
	return 0;
}
int int_cmp(const void* p1, const void* p2)
{
	return (*(int*)p1 - *(int*)p2);
}

void _swap(void* p1, void* p2, int size)
{
	int i = 0;
	for (i = 0; i < size; i++)
	{
		char tmp = (( char *)p1 + i);
		*(( char *)p1 + i) = *(( char *)p2 + i);
		*(( char *)p2 + i) = tmp;
	}
}

void bubble(void* base, int count, int size, int (*cmp)(void*, void*))
{
	int i = 0;
	int j = 0;
	for (i = 0; i < count - 1; i++)
	{
		for (j = 0; i < count - i - 1; j++)
		{
			if (cmp((char*)base + j * size, (char*)base + (j + 1) * size) > 0)
			{
				_swap((char*)base + j * size, (char*)base + (j + 1) * size, size);
			}
		}
	}
}

int main()
{
	int arr[] = { 1,5,6,8,4,7,9,3,2,0 };
	int i = 0;
		bubble(arr, sizeof(arr) / sizeof(arr[0]), sizeof(int), int_cmp);
		for (i=0 ; i < sizeof(arr) / sizeof(arr[0]); i++)
		{
			printf("%d", arr[i]);
		}
		printf("\n");
		return 0;
}